منابع مشابه
A Collaborative Recommend Algorithm Based on Bipartite Community
The recommendation algorithm based on bipartite network is superior to traditional methods on accuracy and diversity, which proves that considering the network topology of recommendation systems could help us to improve recommendation results. However, existing algorithms mainly focus on the overall topology structure and those local characteristics could also play an important role in collabor...
متن کاملA Novel Collaborative Filtering Algorithm Based on Bipartite Network Projection
In this paper, we present a collaborative filtering algorithm based on the bipartite network projection. First, we project the bipartite network to a weighted directed one-mode network in order to retain original information and extract hidden information. The weight of an edge denotes how important the ending vertex is to the starting one. Then, we implement the algorithm using projection netw...
متن کاملCommunity-based Collaborative Filtering Recommendation Algorithm
Collaborative filtering recommendation technology is by far the most widely used and successful personalized recommendation technology. However, the method currently faced with some problems such as sparse matrix, affecting the accuracy of the predicted results. This paper puts forward a new community detection algorithm based on topological potential theory, and combines it with collaborative ...
متن کاملCollaboration space division in collaborative product development based on a genetic algorithm
The advance in the global environment, rapidly changing markets, and information technology has created a new stage for design. In such an environment, one strategy for success is the Collaborative Product Development (CPD). Organizing people effectively is the goal of Collaborative Product Development, and it solves the problem with certain foreseeability. The development group activities are ...
متن کاملAn Extension of Community Extraction Algorithm on Bipartite Graph
We introduce a truss decomposition algorithm for bipartite graphs. A subgraph G of a graph is called k-truss if there are at least k-2 triangles containing any edge e of G. By a standard breadth-first-search algorithm, we can compute the truss decomposition for large graphs. To extract a dense substructure that represents community in graph G, this method avoids the intractable problem of cliqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/295931